Biased Boltzmann samplers and generation of extended linear languages with shuffle
نویسندگان
چکیده
This paper is devoted to the construction of Boltzmann samplers according to various distributions, and uses stochastic bias on the parameter of a Boltzmann sampler, to produce a sampler with a different distribution for the size of the output. As a significant application, we produce Boltzmann samplers for words defined by regular specifications containing shuffle operators and linear recursions. This sampler has linear complexity in the size of the output, where the complexity is measured in terms of real-arithmetic operations and evaluations of generating functions.
منابع مشابه
Multi-dimensional Boltzmann Sampling of context-free Languages
This paper addresses the uniform random generation of words from a context-free language (over an alphabet of size k), while constraining every letter to a targeted frequency of occurrence. Our approach consists in an extended – multidimensional – version of the classic Boltzmann samplers [7]. We show that, under mostly strong-connectivity hypotheses, our samplers return a word of size in [(1 −...
متن کاملMulti-dimensional Boltzmann Sampling of Languages
This paper addresses the uniform random generation of words from a context-free language (over an alphabet of size k), while constraining every letter to a targeted frequency of occurrence. Our approach consists in a multidimensional extension of Boltzmann samplers [7]. We show that, under mostly strong-connectivity hypotheses, our samplers return a word of size in [(1− ε)n, (1 + ε)n] and exact...
متن کاملBoltzmann Samplers for v-balanced Colored Necklaces
This paper is devoted to the random generation of particular colored necklaces for which the number of beads of a given color is constrained (these necklaces are called v-balanced). We propose an efficient sampler (its expected time complexity is linear) which satisfies the Boltzmann model principle introduced by Duchon, Flajolet, Louchard and Schaeffer (7). Our main motivation is to show that ...
متن کاملBoltzmann sampling of ordered structures
Boltzmann models from statistical physics combined with methods from analytic combinatorics give rise to efficient algorithms for the random generation of combinatorials objects. This paper proposes an efficient sampler which satisfies the Boltzmann model principle for ordered structures. This goal is achieved using a special operator, named box operator. Under an abstract real-arithmetic compu...
متن کاملBoltzmann samplers for random generation of lambda terms
Randomly generating structured objects is important in testing and optimizing functional programs, whereas generating random λ-terms is more specifically needed for testing and optimizing compilers. For that a tool called QuickCheck has been proposed, but in this tool the control of the random generation is left to the programmer. Ten years ago, a method called Boltzmann samplers has been propo...
متن کامل